Can PIRCHE-II Matching Outmatch Traditional HLA Matching?

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HLA matching

INTRODUCTION — The evidence that antigens of the HLA system provide the major barrier to acceptance of renal transplants was first obtained with living-related donor transplants. Graft survival was superior in sibling pairs having both the same serologically defined HLA antigens and a nonreactive in vitro mixed lymphocyte proliferative response when compared to randomly matched cadaveric donors...

متن کامل

Fast Least Square Matching

Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

Computational Approaches to Facilitate Epitope-Based HLA Matching in Solid Organ Transplantation

Epitope-based HLA matching has been emerged over the last few years as an improved method for HLA matching in solid organ transplantation. The epitope-based matching concept has been incorporated in both the PIRCHE-II and the HLAMatchmaker algorithm to find the most suitable donor for a recipient. For these algorithms, high-resolution HLA genotype data of both donor and recipient is required. S...

متن کامل

Randomized Greedy Matching II

Abstra t We onsider the following randomized algorithm for nding a mat hingM in an arbitrary graph G = (V;E). Repeatedly, hoose a random vertex u, then a random neighbour v of u. Add edge fu; vg to M and delete verti es u; v from G along with any verti es that be ome isolated. Our main result is that there exists a positive onstant su h that the expe ted ratio of the size of the mat hing produ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Immunology

سال: 2021

ISSN: 1664-3224

DOI: 10.3389/fimmu.2021.631246